Convergence of Discretization Procedures in Dynamic Programming
نویسنده
چکیده
nonlinear element functlon of two state variables,” IEEE Trans. Automar. Conrr. (Short Paper), vol. AC-13, pp. 573-575, Oct 1968. 131 N. Saty-rayana, M. A. L. Thathachar, and M. D. Srinath, “Stability of a class of multiphcatlve nonlinear systems,” IEEE Tam. Automat. Contr. (Short Paper), vol. AC-15, pp. 647649, Dec. 1970. (41 N. Satyanarayana and M. D. Srinatb, “Criteria for stability of a class of multiplica-
منابع مشابه
Error Analysis of Conventional Discrete and Gradient Dynamic Programming
An asymptotic error analysis of the conventional discrete dynamic programming (DDP) method is presented, and upper bounds of the error in the control policy (i.e., the difference of the estimated and true optimal control) at each operation period are computed. This error is shown to be of the order of the state discretization interval (AS), a result with significant implications in the optimiza...
متن کاملExtracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method
In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...
متن کاملA Simulation-based Approach to Stochastic Dynamic Programming
In this paper we develop a simulation-based approach to stochastic dynamic programming. To solve the Bellman equation we construct Monte Carlo estimates of Q-values. Our method is scalable to high dimensions and works in both continuous and discrete state and decision spaces whilst avoiding discretization errors that plague traditional methods. We provide a geometric convergence rate. We illust...
متن کاملA Hybrid Differential Dynamic Programming Algorithm for Robust Low-Thrust Optimization
Low-thrust propulsion is becoming increasingly considered for future space missions, but optimization of the resulting trajectories is very challenging. To solve such complex problems, differential dynamic programming is a proven technique based on Bellman’s Principle of Optimality and successive minimization of quadratic approximations. In this paper, we build upon previous and existing optimi...
متن کاملA Discrete Dynamic Programming Approximation to the Multiobjective Deterministic Finite Horizon Optimal Control Problem
This paper addresses the problem of finding an approximation to the minimal element set of the objective space for the class of multiobjective deterministic finite horizon optimal control problems. The objective space is assumed to be partially ordered by a pointed convex cone containing the origin. The approximation procedure consists of a two-step discretization in time and state space. Follo...
متن کامل